The eccentricity sequences of Fibonacci and Lucas cubes
نویسندگان
چکیده
The Fibonacci cube Γn is the subgraph of the hypercube induced by the binary strings that contain no two consecutive 1’s. The Lucas cube Λn is obtained from Γn by removing vertices that start and end with 1. The eccentricity of a vertex u, denoted eG(u) is the greatest distance between u and any other vertex v in the graph G. For a given vertex u of Γn we characterize the vertices v such that dΓn(u, v) = eΓn(u). We then obtain the generating functions of the eccentricity sequences of Γn and Λn. As a corollary we deduce the number of vertices of a given eccentricity.
منابع مشابه
The (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملAsymptotic properties of Fibonacci cubes and Lucas cubes
It is proved that the asymptotic average eccentricity and the asymptotic average degree of both Fibonacci cubes and Lucas cubes are (5 + √ 5)/10 and (5 − √ 5)/5, respectively. A new labeling of the leaves of Fibonacci trees is introduced and it is proved that the eccentricity of a vertex of a given Fibonacci cube is equal to the depth of the associated leaf in the corresponding Fibonacci tree. ...
متن کاملCube polynomial of Fibonacci and Lucas cubes
The cube polynomial of a graph is the counting polynomial for the number of induced k-dimensional hypercubes (k ≥ 0). We determine the cube polynomial of Fibonacci cubes and Lucas cubes, as well as the generating functions for the sequences of these cubes. Several explicit formulas for the coefficients of these polynomials are obtained, in particular they can be expressed with convolved Fibonac...
متن کاملخواص متریک و ترکیبیاتی مکعب‌های فیبوناتچی و لوکاس
An n-dimensional hypercube, Q_n, is a graph in which vertices are binary strings of length n where two vertices are adjacent if they differ in exactly one coordinate. Hypercubes and their subgraphs have a lot of applications in different fields of science, specially in computer science. This is the reason why they have been investigated by many authors during the years. Some of their subgraphs ...
متن کاملWiener Index and Hosoya Polynomial of Fibonacci and Lucas Cubes
In the language of mathematical chemistry, Fibonacci cubes can be defined as the resonance graphs of fibonacenes. Lucas cubes form a symmetrization of Fibonacci cubes and appear as resonance graphs of cyclic polyphenantrenes. In this paper it is proved that the Wiener index of Fibonacci cubes can be written as the sum of products of four Fibonacci numbers which in turn yields a closed formula f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 312 شماره
صفحات -
تاریخ انتشار 2012